0.12/0.15	% Problem    : Vampire---4.8_10407 : TPTP v0.0.0. Released v0.0.0.
0.12/0.16	% Command    : run_E %s %d THM
0.17/0.38	% Computer : n011.cluster.edu
0.17/0.38	% Model    : x86_64 x86_64
0.17/0.38	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.17/0.38	% Memory   : 8042.1875MB
0.17/0.38	% OS       : Linux 3.10.0-693.el7.x86_64
0.17/0.38	% CPULimit   : 1440
0.17/0.38	% WCLimit    : 180
0.17/0.38	% DateTime   : Mon Jul  3 12:58:39 EDT 2023
0.17/0.38	% CPUTime    : 
0.23/0.55	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.aoaVbYtln0/Vampire---4.8_10407
0.23/0.55	# Version: 3.1pre001-ho
0.39/0.83	# Preprocessing class: HSLSSMSSSSSNHSA.
0.39/0.83	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.39/0.83	# Starting full_lambda_9 with 900s (5) cores
0.39/0.83	# Starting new_ho_11 with 180s (1) cores
0.39/0.83	# Starting sh2l with 180s (1) cores
0.39/0.83	# Starting new_bool_6 with 180s (1) cores
0.39/0.83	# full_lambda_9 with pid 10585 completed with status 0
0.39/0.83	# Result found by full_lambda_9
0.39/0.83	# Preprocessing class: HSLSSMSSSSSNHSA.
0.39/0.83	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.39/0.83	# Starting full_lambda_9 with 900s (5) cores
0.39/0.83	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.39/0.83	# Search class: HGHSM-FSLM32-DHSFFSBN
0.39/0.83	# Scheduled 6 strats onto 5 cores with 900 seconds (900 total)
0.39/0.83	# Starting full_lambda_3 with 415s (1) cores
0.39/0.83	# Starting full_lambda_9 with 91s (1) cores
0.39/0.83	# Starting pre_casc_4 with 123s (1) cores
0.39/0.83	# Starting lpo5_fix with 82s (1) cores
0.39/0.83	# Starting new_bool_12 with 82s (1) cores
0.39/0.83	# pre_casc_4 with pid 10593 completed with status 0
0.39/0.83	# Result found by pre_casc_4
0.39/0.83	# Preprocessing class: HSLSSMSSSSSNHSA.
0.39/0.83	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.39/0.83	# Starting full_lambda_9 with 900s (5) cores
0.39/0.83	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.39/0.83	# Search class: HGHSM-FSLM32-DHSFFSBN
0.39/0.83	# Scheduled 6 strats onto 5 cores with 900 seconds (900 total)
0.39/0.83	# Starting full_lambda_3 with 415s (1) cores
0.39/0.83	# Starting full_lambda_9 with 91s (1) cores
0.39/0.83	# Starting pre_casc_4 with 123s (1) cores
0.39/0.83	# Preprocessing time       : 0.013 s
0.39/0.83	# Presaturation interreduction done
0.39/0.83	
0.39/0.83	# Proof found!
0.39/0.83	# SZS status Theorem
0.39/0.83	# SZS output start CNFRefutation
0.39/0.83	thf(decl_28, type, listIn1312259492pend_a: list_a > (nat > a) > nat > a).
0.39/0.83	thf(decl_33, type, nth_a: list_a > nat > a).
0.39/0.83	thf(decl_36, type, suc: nat > nat).
0.39/0.83	thf(decl_38, type, size_size_list_a: list_a > nat).
0.39/0.83	thf(decl_39, type, ord_less_nat: nat > nat > $o).
0.39/0.83	thf(decl_40, type, ord_less_eq_nat: nat > nat > $o).
0.39/0.83	thf(decl_41, type, f: nat > a).
0.39/0.83	thf(decl_42, type, g: nat > a).
0.39/0.83	thf(decl_43, type, xs: list_a).
0.39/0.83	thf(decl_44, type, ys: list_a).
0.39/0.83	thf(decl_45, type, esk1_0: nat).
0.39/0.83	thf(fact_45_dual__order_Ostrict__trans, axiom, ![X23:nat, X21:nat, X24:nat]:((((ord_less_nat @ X24 @ X21)<=(ord_less_nat @ X24 @ X23))<=(ord_less_nat @ X23 @ X21))), file('/export/starexec/sandbox/tmp/tmp.aoaVbYtln0/Vampire---4.8_10407', fact_45_dual__order_Ostrict__trans)).
0.39/0.83	thf(conj_2, conjecture, ![X17:nat]:((((nth_a @ xs @ X17)=(nth_a @ ys @ X17))|~((ord_less_nat @ X17 @ (size_size_list_a @ xs))))), file('/export/starexec/sandbox/tmp/tmp.aoaVbYtln0/Vampire---4.8_10407', conj_2)).
0.39/0.83	thf(fact_215_less__Suc__eq__le, axiom, ![X2:nat, X1:nat]:(((ord_less_nat @ X2 @ (suc @ X1))<=>(ord_less_eq_nat @ X2 @ X1))), file('/export/starexec/sandbox/tmp/tmp.aoaVbYtln0/Vampire---4.8_10407', fact_215_less__Suc__eq__le)).
0.39/0.83	thf(fact_197_less__antisym, axiom, ![X1:nat, X2:nat]:((((ord_less_nat @ X1 @ (suc @ X2))=>((X2)=(X1)))<=~((ord_less_nat @ X1 @ X2)))), file('/export/starexec/sandbox/tmp/tmp.aoaVbYtln0/Vampire---4.8_10407', fact_197_less__antisym)).
0.39/0.83	thf(conj_1, hypothesis, (ord_less_eq_nat @ (size_size_list_a @ xs) @ (size_size_list_a @ ys)), file('/export/starexec/sandbox/tmp/tmp.aoaVbYtln0/Vampire---4.8_10407', conj_1)).
0.39/0.83	thf(fact_3_i__append__nth1, axiom, ![X1:nat, X107:list_a, X108:nat > a]:((((listIn1312259492pend_a @ X107 @ X108 @ X1)=(nth_a @ X107 @ X1))<=(ord_less_nat @ X1 @ (size_size_list_a @ X107)))), file('/export/starexec/sandbox/tmp/tmp.aoaVbYtln0/Vampire---4.8_10407', fact_3_i__append__nth1)).
0.39/0.83	thf(fact_117_not__less, axiom, ![X9:nat, X10:nat]:((~((ord_less_nat @ X9 @ X10))<=>(ord_less_eq_nat @ X10 @ X9))), file('/export/starexec/sandbox/tmp/tmp.aoaVbYtln0/Vampire---4.8_10407', fact_117_not__less)).
0.39/0.83	thf(conj_0, hypothesis, ![X20:nat]:(((listIn1312259492pend_a @ xs @ f @ X20)=(listIn1312259492pend_a @ ys @ g @ X20))), file('/export/starexec/sandbox/tmp/tmp.aoaVbYtln0/Vampire---4.8_10407', conj_0)).
0.39/0.83	thf(c_0_8, plain, ![X23:nat, X21:nat, X24:nat]:(((ord_less_nat @ X23 @ X21)=>((ord_less_nat @ X24 @ X23)=>(ord_less_nat @ X24 @ X21)))), inference(fof_simplification,[status(thm)],[fact_45_dual__order_Ostrict__trans])).
0.39/0.83	thf(c_0_9, negated_conjecture, ~(![X17:nat]:((((nth_a @ xs @ X17)=(nth_a @ ys @ X17))|~(ord_less_nat @ X17 @ (size_size_list_a @ xs))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_2])])).
0.39/0.83	thf(c_0_10, plain, ![X1275:nat, X1276:nat, X1277:nat]:((~(ord_less_nat @ X1275 @ X1276)|(~(ord_less_nat @ X1277 @ X1275)|(ord_less_nat @ X1277 @ X1276)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])).
0.39/0.83	thf(c_0_11, negated_conjecture, (((nth_a @ xs @ esk1_0)!=(nth_a @ ys @ esk1_0))&(ord_less_nat @ esk1_0 @ (size_size_list_a @ xs))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
0.39/0.83	thf(c_0_12, plain, ![X760:nat, X761:nat]:(((~(ord_less_nat @ X760 @ (suc @ X761))|(ord_less_eq_nat @ X760 @ X761))&(~(ord_less_eq_nat @ X760 @ X761)|(ord_less_nat @ X760 @ (suc @ X761))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_215_less__Suc__eq__le])])).
0.39/0.83	thf(c_0_13, plain, ![X1:nat, X2:nat]:((~(ord_less_nat @ X1 @ X2)=>((ord_less_nat @ X1 @ (suc @ X2))=>((X2)=(X1))))), inference(fof_simplification,[status(thm)],[fact_197_less__antisym])).
0.39/0.83	thf(c_0_14, plain, ![X3:nat, X2:nat, X1:nat]:(((ord_less_nat @ X3 @ X2)|~((ord_less_nat @ X1 @ X2))|~((ord_less_nat @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.39/0.83	thf(c_0_15, negated_conjecture, (ord_less_nat @ esk1_0 @ (size_size_list_a @ xs)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.39/0.83	thf(c_0_16, plain, ![X1:nat, X2:nat]:(((ord_less_nat @ X1 @ (suc @ X2))|~((ord_less_eq_nat @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.39/0.83	thf(c_0_17, hypothesis, (ord_less_eq_nat @ (size_size_list_a @ xs) @ (size_size_list_a @ ys)), inference(split_conjunct,[status(thm)],[conj_1])).
0.39/0.83	thf(c_0_18, plain, ![X1:nat, X107:list_a, X108:nat > a]:(((ord_less_nat @ X1 @ (size_size_list_a @ X107))=>((listIn1312259492pend_a @ X107 @ X108 @ X1)=(nth_a @ X107 @ X1)))), inference(fof_simplification,[status(thm)],[fact_3_i__append__nth1])).
0.39/0.83	thf(c_0_19, plain, ![X1073:nat, X1074:nat]:(((ord_less_nat @ X1073 @ X1074)|(~(ord_less_nat @ X1073 @ (suc @ X1074))|((X1074)=(X1073))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])).
0.39/0.83	thf(c_0_20, negated_conjecture, ![X1:nat]:(((ord_less_nat @ esk1_0 @ X1)|~((ord_less_nat @ (size_size_list_a @ xs) @ X1)))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.39/0.83	thf(c_0_21, hypothesis, (ord_less_nat @ (size_size_list_a @ xs) @ (suc @ (size_size_list_a @ ys))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.39/0.83	thf(c_0_22, plain, ![X9:nat, X10:nat]:((~(ord_less_nat @ X9 @ X10)<=>(ord_less_eq_nat @ X10 @ X9))), inference(fof_simplification,[status(thm)],[fact_117_not__less])).
0.39/0.83	thf(c_0_23, plain, ![X1043:nat, X1044:list_a, X1045:nat > a]:((~(ord_less_nat @ X1043 @ (size_size_list_a @ X1044))|((listIn1312259492pend_a @ X1044 @ X1045 @ X1043)=(nth_a @ X1044 @ X1043)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])).
0.39/0.83	thf(c_0_24, plain, ![X1:nat, X2:nat]:(((ord_less_nat @ X1 @ X2)|((X2)=(X1))|~((ord_less_nat @ X1 @ (suc @ X2))))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.39/0.83	thf(c_0_25, hypothesis, (ord_less_nat @ esk1_0 @ (suc @ (size_size_list_a @ ys))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.39/0.83	thf(c_0_26, plain, ![X771:nat, X772:nat]:((((ord_less_nat @ X771 @ X772)|(ord_less_eq_nat @ X772 @ X771))&(~(ord_less_eq_nat @ X772 @ X771)|~(ord_less_nat @ X771 @ X772)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])).
0.39/0.83	thf(c_0_27, hypothesis, ![X759:nat]:(((listIn1312259492pend_a @ xs @ f @ X759)=(listIn1312259492pend_a @ ys @ g @ X759))), inference(variable_rename,[status(thm)],[conj_0])).
0.39/0.83	thf(c_0_28, plain, ![X1:nat, X85:nat > a, X15:list_a]:((((listIn1312259492pend_a @ X15 @ X85 @ X1)=(nth_a @ X15 @ X1))|~((ord_less_nat @ X1 @ (size_size_list_a @ X15))))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.39/0.83	thf(c_0_29, hypothesis, (((size_size_list_a @ ys)=(esk1_0))|(ord_less_nat @ esk1_0 @ (size_size_list_a @ ys))), inference(spm,[status(thm)],[c_0_24, c_0_25])).
0.39/0.83	thf(c_0_30, plain, ![X2:nat, X1:nat]:((~((ord_less_eq_nat @ X1 @ X2))|~((ord_less_nat @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_26])).
0.39/0.83	thf(c_0_31, hypothesis, ![X1:nat]:(((listIn1312259492pend_a @ xs @ f @ X1)=(listIn1312259492pend_a @ ys @ g @ X1))), inference(split_conjunct,[status(thm)],[c_0_27])).
0.39/0.83	thf(c_0_32, hypothesis, ![X85:nat > a]:((((listIn1312259492pend_a @ ys @ X85 @ esk1_0)=(nth_a @ ys @ esk1_0))|((size_size_list_a @ ys)=(esk1_0)))), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.39/0.83	thf(c_0_33, negated_conjecture, ![X85:nat > a]:(((listIn1312259492pend_a @ xs @ X85 @ esk1_0)=(nth_a @ xs @ esk1_0))), inference(spm,[status(thm)],[c_0_28, c_0_15])).
0.39/0.83	thf(c_0_34, negated_conjecture, ((nth_a @ xs @ esk1_0)!=(nth_a @ ys @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.39/0.83	thf(c_0_35, hypothesis, ~((ord_less_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))), inference(spm,[status(thm)],[c_0_30, c_0_17])).
0.39/0.83	thf(c_0_36, hypothesis, ((size_size_list_a @ ys)=(esk1_0)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_33]), c_0_34])).
0.39/0.83	thf(c_0_37, hypothesis, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_36]), c_0_15])]), ['proof']).
0.39/0.83	# SZS output end CNFRefutation
0.39/0.83	# Parsed axioms                        : 282
0.39/0.83	# Removed by relevancy pruning/SinE    : 42
0.39/0.83	# Initial clauses                      : 573
0.39/0.83	# Removed in clause preprocessing      : 15
0.39/0.83	# Initial clauses in saturation        : 558
0.39/0.83	# Processed clauses                    : 1225
0.39/0.83	# ...of these trivial                  : 17
0.39/0.83	# ...subsumed                          : 245
0.39/0.83	# ...remaining for further processing  : 963
0.39/0.83	# Other redundant clauses eliminated   : 56
0.39/0.83	# Clauses deleted for lack of memory   : 0
0.39/0.83	# Backward-subsumed                    : 2
0.39/0.83	# Backward-rewritten                   : 46
0.39/0.83	# Generated clauses                    : 6686
0.39/0.83	# ...of the previous two non-redundant : 6400
0.39/0.83	# ...aggressively subsumed             : 0
0.39/0.83	# Contextual simplify-reflections      : 2
0.39/0.83	# Paramodulations                      : 6569
0.39/0.83	# Factorizations                       : 6
0.39/0.83	# NegExts                              : 2
0.39/0.83	# Equation resolutions                 : 65
0.39/0.83	# Total rewrite steps                  : 449
0.39/0.83	# Propositional unsat checks           : 0
0.39/0.83	#    Propositional check models        : 0
0.39/0.83	#    Propositional check unsatisfiable : 0
0.39/0.83	#    Propositional clauses             : 0
0.39/0.83	#    Propositional clauses after purity: 0
0.39/0.83	#    Propositional unsat core size     : 0
0.39/0.83	#    Propositional preprocessing time  : 0.000
0.39/0.83	#    Propositional encoding time       : 0.000
0.39/0.83	#    Propositional solver time         : 0.000
0.39/0.83	#    Success case prop preproc time    : 0.000
0.39/0.83	#    Success case prop encoding time   : 0.000
0.39/0.83	#    Success case prop solver time     : 0.000
0.39/0.83	# Current number of processed clauses  : 479
0.39/0.83	#    Positive orientable unit clauses  : 86
0.39/0.83	#    Positive unorientable unit clauses: 1
0.39/0.83	#    Negative unit clauses             : 66
0.39/0.83	#    Non-unit-clauses                  : 326
0.39/0.83	# Current number of unprocessed clauses: 6092
0.39/0.83	# ...number of literals in the above   : 24441
0.39/0.83	# Current number of archived formulas  : 0
0.39/0.83	# Current number of archived clauses   : 442
0.39/0.83	# Clause-clause subsumption calls (NU) : 76637
0.39/0.83	# Rec. Clause-clause subsumption calls : 13156
0.39/0.83	# Non-unit clause-clause subsumptions  : 166
0.39/0.83	# Unit Clause-clause subsumption calls : 1655
0.39/0.83	# Rewrite failures with RHS unbound    : 0
0.39/0.83	# BW rewrite match attempts            : 35
0.39/0.83	# BW rewrite match successes           : 5
0.39/0.83	# Condensation attempts                : 0
0.39/0.83	# Condensation successes               : 0
0.39/0.83	# Termbank termtop insertions          : 206201
0.39/0.83	
0.39/0.83	# -------------------------------------------------
0.39/0.83	# User time                : 0.244 s
0.39/0.83	# System time              : 0.018 s
0.39/0.83	# Total time               : 0.262 s
0.39/0.83	# Maximum resident set size: 4196 pages
0.39/0.83	
0.39/0.83	# -------------------------------------------------
0.39/0.83	# User time                : 1.134 s
0.39/0.83	# System time              : 0.047 s
0.39/0.83	# Total time               : 1.181 s
0.39/0.83	# Maximum resident set size: 2156 pages
0.39/0.83	% E---3.1 exiting
0.39/0.83	EOF